搜索资源列表
bellman
- 用C语言实现最短路径算法中的Bellman-Ford算法，这个算法可以用来解决信号处理中的一些问题。bellman_ford.c为源程序；distance.txt文件存放各界点之间的距离，以99999表示无穷大；bellman_ford.txt文件是输出文件，存放每轮循环得到的中间值，以及最后得到的到各个节点的最短距离，如果图包含负回路，文件中返回FALSE。-C language shortest path algorithm to achieve the Bellman-Ford algor
Bellma-Ford
- Bellman-Ford算法。在最短路径和差分约束用的比较广泛
dsdv
- ns2下dsdv实现代码。DSDV（Destination-Sequenced Distance-Vector）协议是先应式路由协议，是由传统的Bellman-Ford 路由协议改进得到的，其特点是利用目的节点序列号解决了DBF算法的路由环路和无穷计数问题。-dsdv the realization of the code under ns2. DSDV (Destination-Sequenced Distance-Vector) protocol is proactive routing p
clustering
- bellman ford algorithm implemented in C#.NET
New-WinRAR-ZIP-archive
- Bellman-Ford Shortest Path Algorithm (C) 2004 by Yu Hen Hu find shortest path from a fixed point U to any node V clear all n=input( Total number of nodes = ) echo on starting from a fixed point U, you enter the weight to each
bellman-ford
- bellman-ford的实现。可以输出每条最短路径经过的节点-bellman-ford implementation. After the shortest path to the output node of each
BELLMAN-FORD
- Bellman Ford algorithm for finding negative weight of the graph.
dsdv.tcl
- Destination-Sequenced Distance Vector is a table-driven routing scheme for ad hoc mobile networks based on the Bellman-Ford algorithm, Use of network simulation tool NS2, TCL coding.
bellman-ford
- Bellman-Ford Routing Algorithm
Bellman-ford-algorithm
- this is about bellman ford algorithm
The-shortest-path-bellman-ford
- 在实际问题中，边的权值一般以正权的形式出现，但是很多情况下负权也是存在的。这个时候，最短路径不一定存在。我们无法得到像dijkstra算法那样时间复杂度较低的算法，但是，仍然可以用bellman-ford迭代算法去解决问题。 bellman-ford算法是迭代算法，它不像dijkstra算法，按照一定的顺序直接算出每个点的距离值，而是不断地修改每个点的当前最小距离值，直到求出真正的最短距离为止。 -In practical problems, the edge weight is gen
bellman-ford
- 链路状态法，即bellman-ford算法-Link state law, that the bellman-ford algorithm
bellman-ford-algorithm
- 最短路径算法—Bellman-Ford(贝尔曼 福特 贝尔曼-福特 最短路径算法 贝尔曼 福特) 算法分析与实现-bellman-ford algorithm to calculate the shortest walk from a source node
Bellman-ford
- 单源最短路径Bellman-ford。该算法可以用来解决一般（边的权值为负）的单源最短路径问题，而dijkstra只能解决权值非负的情况。此算法使用松弛技术，对每一个顶点，逐步减少源到该顶点的路径的估计值，直到达到最短的路径。-Single source shortest path Bellman-ford. The algorithm can be used to solve the general (the right side is negative) single-source shor
Bellman-ford
- Program to implement Bellman Ford Algorithm
bellman-ford
- bellman-ford 一种可计算负权值的最短路算法-bellman-ford one kind of negative weights to calculate the shortest path algorithm
bellman ford in Java 2
- bellman ford in Java 2
bellman-ford-algorithm
- 图算法-bellman-ford算法的实现-graph algorithm :bellman-ford cometure
Bellman-Ford-queue-optimization
- Bellman-Ford算法关键之处在于：只有那些在前一遍松弛中改变了最短路程估计值的顶点，才能引起它们邻接点最短路程估计值发生改变。-Bellman-Ford algorithm that crucial point: Only those former slack again changed the vertex shortest distance estimates, causing their neighbors to the shortest distance estimates ch
Bellman-Ford
- Bellman Ford imlplementation